TRB exam online practice test for Computer Science and Engineering dept provides you with ample practice material for TRB exam preparation for cse department which adheres to the real exam format. Each TRB - CSE exam practice test has 10 questions. After completing click on to the COMPLETE TEST to know the score and the correct answers.


Computer Science and Engineering - TRB Online Practice Test - 10

  • Online Practice Test - CSE
   

1.
  The result of the subtraction using 2' s complementary arithmetic for :
(0.01111 -0.01001, 111.01-010.111) are .
  • A.   (0.00110, 100.011)
  •  
  • B.   (1.0010, 110.110)
  •  
  • C.   (0.110101, 0100.100)
  •  
  • D.   (1.00111, 101.1101)
  Options: A    B    C    D   
   
 
   

2.
  Simple cache model, 1 level only; which is the cache access time if the access time from the processor view is 5ns, the hit ratio is 99% and the cache access time is 1/400 of the memory access time? .
  • A.   2ns
  •  
  • B.   1ns
  •  
  • C.   0.75ns
  •  
  • D.   3ns
  Options: A    B    C    D   
   
   

3.
  Suppose we have two implementations of the same instruction set architecture. Computer A has a clocktime of 250 ps and a CPI of 2 for some program and computer B has a clock cycle time of 500 ps and a CPI of 1.2 for the same program. The computer that is faster than the other by :.
  • A.   B is faster than A by 1.2 times
  •  
  • B.   B is faster than A by 0.83 times
  •  
  • C.   A is faster than B by 1.2 times
  •  
  • D.   A is faster than B by 0.83 times
  Options: A    B    C    D   
   
 
   

4.
  What would be the output returned b y the following recursive function after a call test (0, 3)

int test (0, 3)
int test (int a, int b)
{
if (a= =b) return(1);
else if (a>b ) return (0);
else return a + test (a+1, b);
}
.
  • A.   1
  •  
  • B.   2
  •  
  • C.   3
  •  
  • D.   4
  Options: A    B    C    D   
   
   

5.
  Consider the virtual page reference string
1 ,2 ,3 ,2 ,4 ,1 ,3 ,2 ,4 ,1
On a demand paged virtual memory system running on a computer system with main memory size of 3 pages frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of pages faults under the corresponding page replacement policy. Then : .
  • A.   OPTIMAL < LRU< FIFO
  •  
  • B.   OPTIMAL = LRU
  •  
  • C.   OPTIMAL< FIFO < LRU
  •  
  • D.   OPTIMAL= FIFO
  Options: A    B    C    D   
   
 
   

6.
  If relation R has m tuples and relation S has n tuples, then the result of Cartesian product on relation R and S will have ------------- tuples..
  • A.   m x n
  •  
  • B.   m/n
  •  
  • C.   m + n
  •  
  • D.   m - n
  Options: A    B    C    D   
   
   

7.
  Every ----------------schedule is also-------------- .
  • A.   View serialization, Conflict serialization
  •  
  • B.   Conflict serialization, View serialization
  •  
  • C.   Cascadeless , Not recoverable
  •  
  • D.   Serial, locking schedule
  Options: A    B    C    D   
   
 
   

8.
  L = {0n! |n ≥ 1} is :.
  • A.   Accepted by NFA
  •  
  • B.   Not regular
  •  
  • C.   Regular
  •  
  • D.   Accepted by DFA
  Options: A    B    C    D   
   
   

9.
  Simplification of the Boolean function , results :
F(ABCDE) = ∑ (0,2,4,6,9,11,13,15,17,21,25,27,29,31) .
  • A.   BE + AD'E + A' B'E'
  •  
  • B.   B'E + ADE + A B' E
  •  
  • C.   AB + BCD'+ B'D
  •  
  • D.   AC' +BCD'+ ABD
  Options: A    B    C    D   
   
 
   

10.
  Suppose the average time to satisfy a disk request is 50 m sec and the I/O system with many disk gets about 200 I/O requests per second. The mean number of I/O requests at the server is :.
  • A.   10
  •  
  • B.   20
  •  
  • C.   30
  •  
  • D.   40
  Options: A    B    C    D   
   

Complete Test
tnscholars.com

 

 

 

tnscholars.com.